2-manifold Recognition Is in Logspace
نویسندگان
چکیده
We prove that the homeomorphism problem for 2–manifolds can be decided in logspace. The proof relies on Reingold’s logspace solution to the undirected s, t-connectivity problem in graphs.
منابع مشابه
بهبود مدل تفکیک‌کننده منیفلدهای غیرخطی به‌منظور بازشناسی چهره با یک تصویر از هر فرد
Manifold learning is a dimension reduction method for extracting nonlinear structures of high-dimensional data. Many methods have been introduced for this purpose. Most of these methods usually extract a global manifold for data. However, in many real-world problems, there is not only one global manifold, but also additional information about the objects is shared by a large number of manifolds...
متن کاملThermo-mechanical high-cycle fatigue analysis of exhaust manifold of turbocharged engine with two-way coupling FSI
NNowadays, car manufactures in order to increasing torque and power with consider to fuel consumption, have swept to production of turbocharged engines. With consider to exhaust gas-temperature rises in boosted engines, recognition of critical locations of exhaust manifold in the worse condition of engine (full load and maximum speed), to prevent fracture of exhaust manifold is very important. ...
متن کاملشناسایی چهره در رشته‌های ویدیویی با استفاده از افکنش متعامد با حفظ ساختار محلی
In this paper, attempting to improve the recognition rate and solve some problems such as pose, lighting variations and partial occlusion in video sequences using Orthogonal Locality Preserving Projection (OLPP). In this research, first of all face in video frames is detected for background removing. Then each set of images is distributed on a nonlinear manifold and clustered using appropriate ...
متن کاملآموزش منیفلد با استفاده از تشکیل گراف منیفلدِ مبتنی بر بازنمایی تنک
In this paper, a sparse representation based manifold learning method is proposed. The construction of the graph manifold in high dimensional space is the most important step of the manifold learning methods that is divided into local and gobal groups. The proposed graph manifold extracts local and global features, simultanstly. After construction the sparse representation based graph manifold,...
متن کاملHelly Circular-Arc Graph Isomorphism Is in Logspace
We present logspace algorithms for the canonical labeling problem and the representation problem of Helly circular-arc (HCA) graphs. The first step is a reduction to canonical labeling and representation of interval intersection matrices. In a second step, the Δ trees employed in McConnell’s linear time representation algorithm for interval matrices are adapted to the logspace setting and endow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JoCG
دوره 7 شماره
صفحات -
تاریخ انتشار 2016